Secure Human Identification Protocol with Human-Computable Passwords
نویسندگان
چکیده
Abstract In this paper we present a new method of secure human-computer identification, which remains safe also in untrusted systems and environments. This allows the elimination any supplementary gadgets/devices or theft-sensitive biometric data used by Multi-Factor Authentication (MFA), using only one secret as universal private key for all obtainable online accounts. However, features solution make it best suited use an mobile authenticator Authority with Single-Sign-On (SSO) identity access management, rather than individual services. Such is our innovative challenge-response protocol to generate One-Time-Password, e.g., 6-digit OTP, could be calculated human 15 s, offline on documents acceptable level security required post-quantum symmetric cyphers, thanks hard lattice problem noise introduced method, call Learning Options (LWO). The has form outline like kind handwritten autograph, designed invisible ink mapping grid. password generation process requires following such contour challenge matrix created randomly verifier reading values from fields calculate OTP.
منابع مشابه
Human Computable Passwords
An interesting challenge for the cryptography community is to design authentication protocols that are so simple that a human can execute them without relying on a fully trusted computer. We propose several candidate authentication protocols for a setting in which the human user can only receive assistance from a semi-trusted computer—a computer that stores information and performs computations...
متن کاملSecure Human Identification Protocols
One interesting and important challenge for the cryptologic community is that of providing secure authentication and identification for unassisted humans. There are a range of protocols for secure identification which require various forms of trusted hardware or software, aimed at protecting privacy and financial assets. But how do we verify our identity, securely, when we don’t have or don’t t...
متن کاملUsability of Humanly Computable Passwords
Reusing passwords across multiple websites is a common practice that compromises security. Recently, Blum and Vempala have proposed password strategies to help people calculate, in their heads, passwords for different sites without dependence on third-party tools or external devices. Thus far, the security and efficiency of these “mental algorithms” has been analyzed only theoretically. But are...
متن کاملSelecting Secure Passwords
We mathematically explore a model for the shortness and security for passwords that are stored in hashed form. The model is implicitly in the NIST publication [8] and is based on conditions of the Shannon, Guessing and Min Entropy. In addition we establish various new relations between these three notions of entropy, providing strong improvements on existing bounds such as the McEliece-Yu bound...
متن کاملSecure Quantum Passwords
We propose a quantum authentication protocol that is robust against the theft of secret keys. In the protocol, disposable quantum passwords prevent impersonation attacks with stolen secret keys. The protocol also prevents the leakage of secret information of a certification agent. [email protected] [email protected]
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-21280-2_25